#include<iostream>
#include<cstdio>
using namespace std;
int dp[100001],a[100001],n;
int mx;
inline int read(){
    int k=0;char f=1,c=getchar();
    for(;!isdigit(c);c=getchar())if(c=='-')f=-1;
    for(;isdigit(c);c=getchar())k=k*10+c-'0';
    return k*f;
}
int main(){
	n=read();
//	memset(dp,1,size)
	for(int i=0;i<n;i++){
		int k;
		a[i]=read();
		dp[i]=1;
		if(a[i]>=a[i-1])dp[i]=dp[i-1]+1;
		mx=max(mx,dp[i]);
	}
	cout<<mx;
} 
